Order theoretic Correspondence theory for Intuitionistic mu-calculus
نویسنده
چکیده
Sahlqvist correspondence theory [3], [4] is one of the most important and useful results of classical modal logic. It gives a syntactic identification of a class of modal formulas whose associated normal modal logics are strongly complete with respect to elementary (i.e. first-order definable) classes of frames. Every Sahlqvist formula is both canonical and corresponds to some elementary frame condition which can be effectively obtained from the formula. Recently this class has significantly been extended to inductive and complex formulas in [2]; moreover, analogous characterizations for logics with a weaker than Boolean propositional base have been given, thanks to a novel, duality based approach [1]. Using the algebraic approach, Sahlqvist and inductive formulas can be equivalently defined in terms of order theoretic conditions on the algebraic interpretation of the logical connectives. The present talk is about an ongoing work with Alessandra Palmigiano and Yves Fomatati, where we focus on modal mu-calculus. Concretely, we generalize the results in [5] to the wider setting of Intuitionistic mu-calculus. We identify the order-theoretic principles leading to the identification of the Sahlqvist mu-formulas in [5], extending it to the Intuitionistic mu-calculus. We also expand the calculus for correspondence defined for Distributive modal logic in [1], which allows us to define an ALBA-type algorithm [1] for logics with fixpoints.
منابع مشابه
Algorithmic correspondence for intuitionistic modal mu-calculus
In the present paper, the algorithmic correspondence theory developed in (Conradie and Palmigiano, 2012) is extended to mu-calculi with a non-classical base. We focus in particular on the language of bi-intuitionistic modal mu-calculus. We enhance the algorithm ALBA introduced in (Conradie and Palmigiano, 2012) so as to guarantee its success on the class of recursive muinequalities, which we in...
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus, Part 2
Sahlqvist-style correspondence results remain a perennial theme and an active topic of research within modal logic. Recently, there has been interest in extending the classical results in this area to the modal mu-calculus [7]. For instance, in [8] van Benthem, Bezhanishvili and Hodkinson define a class of Sahlqvist formulas for the modal mu-calculus, all of which have frame correspondents in f...
متن کاملAlgorithmic correspondence for intuitionistic modal mu-calculus, Part 1
Modal mu-calculus [5] is a logical framework combining simple modalities with fixed point operators, enriching the expressivity of modal logic so as to deal with infinite processes like recursion. It has a simple syntax, an easily given semantics, and is decidable. Many expressive modal and temporal logics such as PDL, CTL and CTL∗ can be seen as fragments of the modal mu-calculus. Sahlqvist-st...
متن کاملAlgorithmic Correspondence and Canonicity for Possibility Semantics (Abstract)
Unified Correspondence. Correspondence and completeness theory have a long history in modal logic, and they are referred to as the “three pillars of wisdom supporting the edifice of modal logic” [22, page 331] together with duality theory. Dating back to [20,21], the Sahlqvist theorem gives a syntactic definition of a class of modal formulas, the Sahlqvist class, each member of which defines an...
متن کاملConstructive Canonicity for Lattice-Based Fixed Point Logics
The present contribution lies at the crossroads of at least three active lines of research in nonclassical logics: the one investigating the semantic and proof-theoretic environment of fixed point expansions of logics algebraically captured by varieties of (distributive) lattice expansions [1, 19, 24, 2, 16]; the one investigating constructive canonicity for intuitionistic and substructural log...
متن کامل